Possible singlet and triplet superconductivity on honeycomb lattice

We study the possible superconducting pairing symmetry mediated by spin and charge fluctuations on the honeycomb lattice using the extended Hubbard model and the random-phase-approximation method. From $2\%$ to $20\%$ doping levels, a spin-singlet $d_{x^{2}-y^{2}}+id_{xy}$-wave is shown to be the leading superconducting pairing symmetry when only the on-site Coulomb interaction $U$ is considered, with the gap function being a mixture of the nearest-neighbor and next-nearest-neighbor pairings. When the offset of the energy level between the two sublattices exceeds a critical value, the most favorable pairing is a spin-triplet $f$-wave which is mainly composed of the next-nearest-neighbor pairing. We show that the next-nearest-neighbor Coulomb interaction $V$ is also in favor of the spin-triplet $f$-wave pairing.Comment: 6 pages, 4 figure

Optimized Cartesian KK-Means

Product quantization-based approaches are effective to encode high-dimensional data points for approximate nearest neighbor search. The space is decomposed into a Cartesian product of low-dimensional subspaces, each of which generates a sub codebook. Data points are encoded as compact binary codes using these sub codebooks, and the distance between two data points can be approximated efficiently from their codes by the precomputed lookup tables. Traditionally, to encode a subvector of a data point in a subspace, only one sub codeword in the corresponding sub codebook is selected, which may impose strict restrictions on the search accuracy. In this paper, we propose a novel approach, named Optimized Cartesian $K$-Means (OCKM), to better encode the data points for more accurate approximate nearest neighbor search. In OCKM, multiple sub codewords are used to encode the subvector of a data point in a subspace. Each sub codeword stems from different sub codebooks in each subspace, which are optimally generated with regards to the minimization of the distortion errors. The high-dimensional data point is then encoded as the concatenation of the indices of multiple sub codewords from all the subspaces. This can provide more flexibility and lower distortion errors than traditional methods. Experimental results on the standard real-life datasets demonstrate the superiority over state-of-the-art approaches for approximate nearest neighbor search.Comment: to appear in IEEE TKDE, accepted in Apr. 201

Security enhancement for NOMA-UAV networks

Owing to its distinctive merits, non-orthogonal multiple access (NOMA) techniques have been utilized in unmanned aerial vehicle (UAV) enabled wireless base stations to provide effective coverage for terrestrial users. However, the security of NOMA-UAV systems remains a challenge due to the line-of-sight air-to-ground channels and higher transmission power of weaker users in NOMA. In this paper, we propose two schemes to guarantee the secure transmission in UAV-NOMA networks. When only one user requires secure transmission, we derive the hovering position for the UAV and the power allocation to meet rate threshold of the secure user while maximizing the sum rate of remaining users. This disrupts the eavesdropping towards the secure user effectively. When multiple users require secure transmission, we further take the advantage of beamforming via multiple antennas at the UAV to guarantee their secure transmission. Due to the non-convexity of this problem, we convert it into a convex one for an iterative solution by using the second order cone programming. Finally, simulation results are provided to show the effectiveness of the proposed scheme